AltGr-Ergo, a Graphical User Interface for the SMT Solver Alt-Ergo
نویسندگان
چکیده
Due to undecidability and complexity of first-order logic, SMT solvers may not terminate on some problems or require a very long time. When this happens, one would like to find the reasons why the solver fails. To this end, we have designed AltGr-Ergo, an interactive graphical interface for the SMT solver Alt-Ergo which allows users and tool developers to help the solver finish some proofs. AltGr-Ergo gives real time feedback in order to evaluate and quantify progress made by the solver, and also offers various syntactic manipulation options to allow a finer grained interaction with Alt-Ergo. This paper describes these features and their implementation, and gives usage scenarios for most of them.
منابع مشابه
Built-in Treatment of an Axiomatic Floating-Point Theory for SMT Solvers
The treatment of the axiomatic theory of floating-point numbers is out of reach of current SMT solvers, especially when it comes to automatic reasoning on approximation errors. In this paper, we describe a dedicated procedure for such a theory, which provides an interface akin to the instantiation mechanism of an SMT solver. This procedure is based on the approach of the Gappa tool: it performs...
متن کاملTuning the Alt-Ergo SMT Solver for B Proof Obligations
In this paper, we present recent developments in the AltErgo SMT-solver to e ciently discharge proof obligations (POs) generated by Atelier B. This includes a new plugin architecture to facilitate experiments with di erent SAT engines, new heuristics to handle quantied formulas, and important modi cations in its internal data structures to boost performances of core decision procedures. Experim...
متن کاملTowards lightweight integration of SMT solvers
A large variety of SMT techniques and associated solvers (i.e., algorithms and software tools) have been developed by the formal modelling and verification communities. For a particular application domain, each technique has its own unique set of advantages and limitations. Within the context of a particular application domain (characterized by a particular set of possible logical formulas), th...
متن کاملA Three-Tier Strategy for Reasoning About Floating-Point Numbers in SMT
The SMT-LIB standard defines a formal semantics for a theory of floating-point (FP) arithmetic (FPA). This formalization reduces FP operations to reals by means of a rounding operator, as done in the IEEE-754 standard. Closely following this description, we propose a three-tier strategy to reason about FPA in SMT solvers. The first layer is a purely axiomatic implementation of the automatable s...
متن کامل